A Binary differential search algorithm for the 0–1 multidimensional knapsack problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAnt Algorithm for the Multidimensional Knapsack Problem
We propose a new algorithm based on the Ant Colony Optimization (ACO) meta-heuristic for the Multidimensional Knapsack Problem, the goal of which is to find a subset of objects that maximizes a given objective function while satisfying some resource constraints. We show that our new algorithm obtains better results than two other ACO algorithms on most instances.
متن کاملA Hybrid Approach for the 01 Multidimensional Knapsack problem
& is called a knapsack constraint. The special case of the MKP01 with %*!) is the classical knapsack problem (KP01), whose usual statement is the following. Given a knapsack of capacity and objects, each being associated a profit (gain) and a volume occupation, one wants to select + ( +, and + not fixed) objects such that the total profit is maximized and the capacity of the knapsack is not exc...
متن کاملA novel binary fruit fly optimization algorithm for solving the multidimensional knapsack problem
In this paper, a novel binary fruit fly optimization algorithm (bFOA) is proposed to solve the multidimensional knapsack problem (MKP). In the bFOA, binary string is used to represent the solution of the MKP, and three main search processes are designed to perform evolutionary search, including smell-based search process, local vision-based search process and global vision-based search process....
متن کاملA Weight-Coded Evolutionary Algorithm for the Multidimensional Knapsack Problem
A revised weight-coded evolutionary algorithm (RWCEA) is proposed for solving multidimensional knapsack problems. This RWCEA uses a new decoding method and incorporates a heuristic method in initialization. Computational results show that the RWCEA performs better than a weight-coded evolutionary algorithm proposed by Raidl (1999) and to some existing benchmarks, it can yield better results tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2016
ISSN: 0307-904X
DOI: 10.1016/j.apm.2016.06.002